Shared-state design modulo weak and strong process fairness
نویسنده
چکیده
A number of rules for proving shared-state programs totally correct with respect to both weak and strong process fairness is presented. The rules are compositional | thus they allow for design in a top-down style. On the other hand, already nished programs can beveriied without the use of program transformation.
منابع مشابه
Verification of progress properties in a shared-memory concurrent system represented as a labeled transition system
A shared memory concurrent system can be modeled as a labeled transition system. The system is assumed to be finite. Verification of progress properties of this kind of systems is studied. We present methods to check “leads-to” type of progress properties from global state graphs for both weakly and strongly fair executions. We also study a new method, applicable for two-process systems under w...
متن کاملA Note on Fairness in I/O Automata
Notions of weak and strong fairness are studied in the setting of the I/O automaton model of Lynch & Tuttle. The concept of a fair I/O automaton is introduced and it is shown that a fair I/O automaton paired with the set of its fair executions is a live I/O automaton provided that (1) in each reachable state at most countably many fairness sets are enabled, and (2) input actions cannot disable ...
متن کاملCharacterizing Fairness Implementability
We present a semantic criterion for fairness notions for multiparty interaction. We show that if a fairness notion violates the criterion, then no deterministic algorithm for multiparty interaction scheduling can satisfy the fairness requirement. Conversely, the implementation is possible if the criterion is obeyed. Thus, the criterion is suucient and necessary to guarantee fairness implementab...
متن کاملThe Quest for Minimal Quotients for Probabilistic Automata
One of the prevailing ideas in applied concurrency theory and verification is the concept of automata minimization with respect to strong or weak bisimilarity. The minimal automata can be seen as canonical representations of the behaviour modulo the bisimilarity considered. Together with congruence results wrt. process algebraic operators, this can be exploited to alleviate the notorious state ...
متن کاملAn Algebra of Boolean Processes
This work has been motivated by the study of the S=R models which allow to represent systems as a set of communicating state machines cooperating through a shared memory. We show that S=R models can be expressed in terms of a process algebra called Boolean SCCS which is a special case of Milner's SCCS, in the sense that the actions are elements of some boolean algebra. We deene for Boolean SCCS...
متن کامل